package com.leetcode.bfs;

import java.util.Collections;
import java.util.HashMap;
import java.util.concurrent.*;

public class Leetcode787 {

    public int findCheapestPrice(int n, int[][] flights, int src, int dst, int K) {
        return 0;
    }

    public static void main(String[] args) throws InterruptedException {
//        Collections.synchronizedMap(new HashMap<>())
        // add remove element
//        BlockingQueue<Integer> queue = new LinkedBlockingQueue<>(3);
//        queue.add(1);
//        queue.add(2);
//        queue.add(3);
//        // queue.add(4); //Exception in thread "main" java.lang.IllegalStateException: Queue full
//        //System.out.println(queue.element());
//        queue.remove();
//        queue.remove();
//        queue.remove();
//        queue.remove(); // Exception in thread "main" java.util.NoSuchElementException

        // offer poll peek
//        BlockingQueue<Integer> queue = new LinkedBlockingQueue<>(3);
//        queue.offer(1);
//        queue.offer(2);
//        queue.offer(3);
//        queue.offer(4);
//        System.out.println(queue.peek());
//        System.out.println(queue.size());
//        System.out.println(queue.poll());
//        System.out.println(queue.poll());
//        System.out.println(queue.poll());
//        System.out.println(queue.poll());
        // put take
//        BlockingQueue<Integer> queue = new LinkedBlockingQueue<>(3);
//        queue.put(1);
//        queue.put(2);
//        queue.put(3);
//        // queue.put(4);
//        System.out.println(queue.take());
//        System.out.println(queue.take());
//        System.out.println(queue.take());
//        System.out.println(queue.take());
//        System.out.println(queue.size());
//        BlockingQueue queue = new PriorityBlockingQueue()
    }
    
}
